Two-Phase Atomic Commitment Protocol in Asynchronous Distributed Systems with Crash Failure
نویسندگان
چکیده
This paper defines the Non-Blocking Atomic Commitment problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by M*, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ◇P. The paper shows that at any environment, the problem is solvable with M*.
منابع مشابه
A Low-Cost Non-Blocking Atomic Commitment Protocol for Asynchronous Systems
In distributed transactional systems, an Atomic Commitment Protocol (ACP) is used to ensure the atomicity of distributed transactions even in the presence of failures. An ACP is said to be non-blocking if it allows correct participants to decide on the transaction despite the failure of others. Several non-blocking protocols have been proposed in the literature. However, none of these protocols...
متن کاملNon-Atomic Commitment Problem: A comparative study between the 2PC and a new protocol based on the consensus paradigm
The atomic commitment problem is of primary importance in distributed systems, this problem become difficult to solve if some participants which are involved by the execution of the transaction commitment fail. Several protocols have been implemented to allow participants to terminate the commitment of transactions. In this paper we give a comparative study between the two phase commit protocol...
متن کاملA Generic Multicast Primitive to Support Transactions on Replicated Objects in Distributed Systems
Locking and atomic commitment are two fundamental problems underlying transaction management in fault-tolerant distributed systems. In this paper we discuss these problems in the context of an asynchronous system with replicated objects. We present a generic primitive, named Dynamic-Terminating-Multicast (or DTM) of which instances enable to implement a locking protocol and an atomic commitment...
متن کاملAtomic Broadcast in Asynchronous Crash-Recovery Distributed Systems and Its Use in Quorum-Based Replication
Atomic Broadcast is a fundamental problem of distributed systems: It states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A Consensus-based solution to Atomic Broadcast problem has been designed by Chandra and Toueg for asynchronous di...
متن کاملNon-Blocking Atomic Commitment with an Unreliable Failure Detector
In a transactional system, an atomic commitment protocol ensures that for any transaction , all Data Manager processes agree on the same outcome (commit or abort). A non-blocking atomic commitment protocol enables an outcome to be decided at every correct process despite the failure of others. In this paper we apply, for the rst time, the fundamental result of Chandra and Toueg on solving the a...
متن کامل